Negotiating for Release Time and Leave
نویسندگان
چکیده
منابع مشابه
A New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time
Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...
متن کاملEffect of Flashing Brake Lights on Drivers\' Brake Reaction Time and Release Gas Pedal Time
Objective: It is believed that drivers play a crucial role in accidents. Paying attention to brake lights, a driver may find out about danger and react. Rear-end collision accidents refer to the part of the accidents due to driver inattention or slow reaction. The aim of this study was to determine the effect of dynamic flashing brake lights (7 Hz) on drivers' brake reaction time using the driv...
متن کاملReflective Negotiating Agents for Real-Time Multisensor Target Tracking
In this paper we describe a multiagent system in which agents negotiate to allocate resources and satisfy constraints in a real-time environment of multisensor target tracking. The agents attempt to optimize the use of their own consumable resources while adhering to the global goal, i.e., accurate and effective multisensor target tracking. Agents negotiate based on different strategies which a...
متن کاملTime to Leave the Trees : From
Current XML query languages operate on XML instances only but ignore valuable conceptual level information that is \buried" inside complex XML Schema documents. For example, XPath queries are evaluated against XML documents based on element names (tags) and their syntactic nesting structure, ignoring the element types and other conceptual level information that is declared in separate XML schem...
متن کاملa new branch-and-bound for the problem of mean completion time for the single machine with release time
preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. in this paper, the same problem has been considered in which objective is to minimize the mean flow time. to prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notices of the American Mathematical Society
سال: 2016
ISSN: 0002-9920,1088-9477
DOI: 10.1090/noti1379